Commitment decisions with partial information updating

In this paper, we extend the results of Ferguson M. Naval Research Logistics 8 . on an end‐product manufacturer's choice of when to commit to an order quantity from its parts supplier. During the supplier's lead‐time, information arrives about end‐product demand. This information reduces some of the forecast uncertainty. While the supplier must choose its production quantity of parts based on the original forecast, the manufacturer can wait to place its order from the supplier after observing the information update. We find that a manufacturer is sometimes better off with a contract requiring an early commitment to its order quantity, before the supplier commits resources. On the other hand, the supplier sometimes prefers a delayed commitment. The preferences depend upon the amount of demand uncertainty resolved by the information as well as which member of the supply chain sets the exchange price. We also show conditions where demand information updating is detrimental to both the manufacturer and the supplier. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

弹药弹体尺寸自动测量系统

在对某系列特种弹药的弹体结构尺寸分析和归类的基础上,详细阐述了弹体几何尺寸的测量原理,并结合工厂的实际,采用激光位移传感器和计算机自动控制技术,实现了弹体的关键尺寸的数字化测量与评价。实际应用表明该系统可以有效地提高弹体尺寸的测量精度并定量评价弹体的尺寸误差,内外径和同轴度的测量精度可达10μm以内,外长的测量精度可达100μm以内,能有效地指导加工的工艺流程和加工的尺寸精度控制。     

导弹发射装置伺服系统模糊PID控制研究

在某型导弹发射装置的伺服系统中,对系统的性能指标要求很高,传统的PID控制往往难以满足要求。以某型导弹发射装置的伺服系统为模型,设计了模糊PID控制器。通过与传统的PID控制器仿真实验对比,可以看出应用模糊PID控制器能够有效提高该伺服系统的动态性能和鲁棒稳定性。     

基于二阶锥规划的MIMO雷达稳健自适应波束形成

针对MIMO雷达自适应波束形成中期望目标导向矢量的失配问题,提出了一种基于二阶锥规划(SOCP)的稳健自适应波束形成算法。该算法首先将1个MN维(M,N分别为发射和接收阵元数)的权矢量分解成2个低维(1个M维和1个N维)权矢量的Kronecker积,然后分别限制实际的目标发射导向矢量和目标接收导向矢量与假定的导向矢量之间的误差范数的边界,通过优化最差性能,利用SOCP求得分解后的2个权矢量,最后再合成原权矢量。通过降维处理,算法在保证波束形成器性能的基础上,有效地降低了运算复杂度。仿真结果验证了算法的有效性。     

舰艇自防御的威胁排序方法研究

威胁评估与排序是舰艇自防御系统必须具备的重要功能。在多指标决策理论的基础上,结合灰色系统理论和逼近理想解方法,提出了灰色逼近理想解的威胁排序算法。首先通过建立舰艇自防御的空中威胁排序指标体系,得到各个指标的隶属度函数,再通过主客观结合的有序二元比较法得到威胁评估指标的权重,最后通过逼近理想解的灰色关联度方法对空中目标进行威胁评估与排序,并研究了分辨系数对威胁排序的影响。通过舰艇自防御防空作战实例证明了算法的有效性和工程实用性。     

基于实值离散Gabor变换的阶比跟踪滤波

提出了基于实值离散Gabor变换的阶比跟踪滤波方法．分析了阶比跟踪滤波为时频滤波的实质,给出了如何通过实值离散Gabor变换实现阶比跟踪滤波的步骤．通过对仿真信号阶比跟踪滤波前后的时频分布、阶比谱和时域信号对比,证实本方法能有效滤除阶比混叠成分．通过延长信号两端采样长度的方法可以消除阶比跟踪滤波后端点的误差．     

Maximizing the ratio of two convex functions over a convex set

The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions f and g over a convex set X. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound search to guarantee that a global optimal solution is found. While it does not require the functions f and g to be differentiable, it does require that subgradients of g can be calculated efficiently. The main computational effort of the algorithm involves solving a sequence of subproblems that can be solved by convex programming methods. When X is polyhedral, these subproblems can be solved by linear programming procedures. Because of these properties, the algorithm offers a potentially attractive means for globally maximizing ratios of convex functions over convex sets. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Selecting T for a periodic review inventory model with staggered deliveries

Consider a single‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. Orders can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T periods, one audits the current stock level and decides on deliveries for the next T periods, thus incurring a fixed audit cost and—when one schedules deliveries—a fixed order cost. The problem is to find a review period T and an ordering policy that satisfy the average cost criterion. The current article extends an earlier treatment of this problem, which assumed that the fixed order cost is automatically incurred once every T periods. We characterize an optimal ordering policy when T is fixed, prove that an optimal review period T** exists, and develop a global search algorithm for its computation. We also study the behavior of four approximations to T** based on the assumption that the fixed order cost is incurred during every cycle. Analytic results from a companion article (where μ/σ is large) and extensive computational experiments with normal and gamma demand test problems suggest these approximations and associated heuristic policies perform well when μ/σ ≥ 2. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 329–352, 2000     

Minimizing sums and products of linear fractional functions over a polytope

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999     

优序法在舰艇编队导弹攻击效能评估中的应用

导弹攻击是舰艇编队海上行动的主要作战样式,其导弹攻击效能的评估十分重要。首先建立了舰艇编队导弹攻击作战效能评价指标体系,然后介绍了评估舰艇编队导弹攻击效能的一种新方法——优序法,该方法应用简单,既可以处理定性问题,又能处理定量问题。最后给出了应用实例,验证了优序法比较适合于对舰艇编队导弹攻击效能进行评估。通过对舰艇编队导弹攻击效能的评估,可以有效地选用合适的舰艇编队样式。